#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
set<int>s;
vector<int>v;
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    int n,k;cin>>n>>k;
    for(int i=0;i<n;i++){
        int x;cin>>x;
        v.push_back(x);
        s.insert(x);
    }
    if(s.size()<k){
        cout<<"NO"<<endl;
        return 0;
    }
    cout<<"YES"<<endl;
    for(int i=0;i<=v.size();i++){
        if(s.count(v[i])&&k){
            cout<<i<<" ";
            s.erase(v[i]);
            k--;
        }
    }
   	return 0;
}
